Modified LLL Algorithm with Shifted Start Column for Complexity Reduction
نویسندگان
چکیده
منابع مشابه
Modified LLL algorithm with shifted start column
Multiple-input multiple-output (MIMO) systems are playing an important role in the recent wireless communication. The complexity of the different systems models challenge different researches to get a good complexity to performance balance. Lattices Reduction Techniques and Lenstra-Lenstra-Lovàsz (LLL) algorithm bring more resources to investigate and can contribute to the complexity reduction ...
متن کاملAn LLL-reduction algorithm with quasi-linear time complexity
We devise an algorithm, e L, with the following specifications: It takes as input an arbitrary basis B = (bi)i ∈ Zd×d of a Euclidean lattice L; It computes a basis of L which is reduced for a mild modification of the Lenstra-Lenstra-Lovász reduction; It terminates in time O(dβ + dβ) where β = log max ‖bi‖ (for any ε > 0 and ω is a valid exponent for matrix multiplication). This is the first LLL...
متن کاملAn LLL Algorithm with Quadratic Complexity
The Lenstra–Lenstra–Lovász lattice basis reduction algorithm (called LLL or L3) is a fundamental tool in computational number theory and theoretical computer science, which can be viewed as an efficient algorithmic version of Hermite’s inequality on Hermite’s constant. Given an integer d-dimensional lattice basis with vectors of Euclidean norm less than B in an ndimensional space, the L3 algori...
متن کاملAn LLL-Reduction Algorithm with Quasi-linear Time Complexity1
We devise an algorithm, e L, with the following specifications: It takes as input an arbitrary basis B = (bi)i ∈ Zd×d of a Euclidean lattice L; It computes a basis of L which is reduced for a mild modification of the Lenstra-Lenstra-Lovász reduction; It terminates in time O(dβ + dβ) where β = log max ‖bi‖ (for any ε > 0 and ω is a valid exponent for matrix multiplication). This is the first LLL...
متن کاملN-Dimensional LLL Reduction Algorithm with Pivoted Reflection
The Lenstra-Lenstra-Lovász (LLL) lattice reduction algorithm and many of its variants have been widely used by cryptography, multiple-input-multiple-output (MIMO) communication systems and carrier phase positioning in global navigation satellite system (GNSS) to solve the integer least squares (ILS) problem. In this paper, we propose an n-dimensional LLL reduction algorithm (n-LLL), expanding t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Wireless & Mobile Networks
سال: 2016
ISSN: 0975-4679,0975-3834
DOI: 10.5121/ijwmn.2016.8306